Parallel Enhanced Pattern Matching Algorithm with Two Sliding Windows PETSW

Accelerating Genomic Analyses with Parallel Sliding Windows

In recent years biology has become an information science, where an avalanche of newly sequenced genomic data has overwhelmed our existing analysis and mining tools. This paper addresses this challenge by developing a systematic way of speeding up a broad class of bioinformatics algorithms using commodity graphics processing hardware. Using the example problem of analyzing DNA structural variat...

Accelerating Genomic Analyses with Parallel Sliding Windows

In recent years biology has become an information science, where an avalanche of newly sequenced genomic data has overwhelmed our existing analysis and mining tools. This paper addresses this challenge by developing a systematic way of speeding up a broad class of bioinformatics algorithms using commodity graphics processing hardware. Using the example problem of analyzing DNA structural variat...

Parallel Vectoring Algorithm for Pattern Matching

The main aim of this study is to propose efficient algorithms for image template matching on parallel machines. To our knowledge there is no a template matching algorithm that converts the template image and all candidate blocks in the source image from two-dimensions into one-dimension. This study proposes a Template Matching Vectoring Algorithm (TMVA) that reduces the amount of data to be ana...

Efficient Two-Dimensional Parallel Pattern Matching with Scaling

Given a text and a pattern, the problem of pattern matching consists of determining all the positions of the text where the pattern occurs. When the text and the pattern are matrices, the matching is termed bidimensional. There are variations of this problem where we allow the matching using a somehow modified pattern. In this paper we assume that the pattern can be scaled. We propose a new par...

Parallel Pattern Matching with Scaling